Sufficient conditions for matchings

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sufficient conditions for univalence and starlikeness

It is known that the condition $mathfrak {Re} left{zf'(z)/f(z)right}>0$, $|z|

متن کامل

Sufficient Conditions for the Existence of Perfect Heterochromatic Matchings in Colored Graphs

Let G = (V, E) be an (edge-)colored graph, i.e., G is assigned a mapping C : E → {1, 2, · · · , r}, the set of colors. A matching of G is called heterochromatic if its any two edges have different colors. Unlike uncolored matchings for which the maximum matching problem is solvable in polynomial time, the maximum heterochromatic matching problem is NP-complete. This means that to find both suff...

متن کامل

On sufficient conditions for the existence of stable matchings with contracts

We introduce two new sufficient conditions for the existence of stable outcomes in many-to-one matching with contracts. The conditions subsume the observable substitutability of Hatfield et al. (2015) and the substitutable completability of Hatfield and Kominers (2016) as special cases. We also prove that unilaterally substitutability and irrelevance of rejected contracts imply substitutable co...

متن کامل

CERTAIN SUFFICIENT CONDITIONS FOR CLOSE-TO-CONVEXITY OF ANALYTIC FUNCTIONS

The object of this paper to derive certain sucient condi-tions for close-to-convexity of certain analytic functions dened on theunit disk  

متن کامل

Sufficient conditions for maximally edge-connected and super-edge-connected

Let $G$ be a connected graph with minimum degree $delta$ and edge-connectivity $lambda$. A graph ismaximally edge-connected if $lambda=delta$, and it is super-edge-connected if every minimum edge-cut istrivial; that is, if every minimum edge-cut consists of edges incident with a vertex of minimum degree.In this paper, we show that a connected graph or a connected triangle-free graph is maximall...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the Edinburgh Mathematical Society

سال: 1972

ISSN: 0013-0915,1464-3839

DOI: 10.1017/s0013091500009809